Irregular Pyramid Segmentations with Stochastic Graph Decimation Strategies
نویسندگان
چکیده
In this paper we use different decimation strategies in irregular pyramid segmentation framework, to produce perceptually important groupings. These graph decimation strategies, based on the maximum independent set concept, used in Bor̊uvka’s minimum spanning tree based partitioning method, show similar discrepancy segmentation errors. Global and local consistency error measures do not show big differences between the methods although human visual inspection of the results show advantages for one method. To a certain extent this subjective impression is captured by the new criteria of ’region size variation’.
منابع مشابه
Combining regular decimation and dual graph contraction for hierarchical image segmentation
The Bounded Irregular Pyramid (BIP) is a hierarchical structure for image representation whose aim is to combine concepts from regular and irregular pyramids. The data structure is a combination of the simplest regular and irregular structures: the 2× 2/4 regular one and the simple graph representation. However, simple graphs only take into account adjacency relationships, being unable to corre...
متن کاملEquivalent Contraction Kernels and the Domain of Dual Irregular Pyramids 1
Dual graph contraction reduces the number of vertices and of edges of a pair of dual image graphs while, at the same time, the topological relations among the 'surviving' components are preserved. Repeated application produces a stack of successively smaller graphs: a pair of dual irregular pyramids. The process is controlled by selected decimation parameters which consist of a subset of surviv...
متن کاملCombinatorial pyramids
An irregular pyramid consists of a stack of successively reduced graphs. Each smaller graph is deduced from the preceding one by the contraction or the removal of a set of edges. Using a fixed decimation ratio we need approximatelyO(log(image size)) graphs to encode the whole pyramid. A combinatorial map encodes a planar graph thanks to two permutations encoding the edges and their orientation ...
متن کاملStochastic pyramid revisited
We focus in this paper on a new model for graph decimation which is based on the stochastic pyramid algorithm. In this study, we present some trends towards a better understanding of the new properties arising from the removal of the sequentiality constraint of this so-called technique. 2002 Elsevier Science B.V. All rights reserved.
متن کاملMatching Hierarchies of Segmentations
We propose to match two hierarchies of segmentations by many-to-many mappings between the regions of the two hierarchies. The mappings preserve the order of the regions (w.r.t. set inclusion) in both hierarchies. The matching involves weights for the significance of individual regions within a hierarchy and similarity measures for the comparison of regions from different hierarchies. Irregular ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006